Runtime optimization of join location in parallel data management systems
نویسندگان
چکیده
منابع مشابه
Runtime Optimization of Join Location in Parallel Data Management Systems
Applications running on parallel systems often need to join a streaming relation or a stored relation with data indexed in a parallel data storage system. Some applications also compute UDFs on the joined tuples. The join can be done at the data storage nodes, corresponding to reduce side joins, or by fetching data from the storage system to compute nodes, corresponding to map side join. Both m...
متن کاملJoin Query Optimization in Parallel Database Systems
In this paper we present a new framework for studying parallel query optimization. We first note that scheduling and optimization must go together in a parallel environment. We introduce the concept of response time envelopes which integrates scheduling and optimization. We show that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity...
متن کاملData-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data (i.e., Bureau of the Census TIGER/Line les). Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the SAM (Scan-AndMonotonic-mapping) model of parallel computa...
متن کاملLet's Rethink Join Optimization in Distributed Systems
Distributed shared-nothing systems that process large-scale data has seen unprecedented developments over the last decade. The advent of Google’s MapReduce [2] and Hadoop [3] has been followed by a series of systems with relational operators or SQL-like interfaces, such as Pig [8], Hive [10], Spark [12], SparkSQL [9], and Myria [4]. One of the core operations performed by these systems is evalu...
متن کاملEntity Join Optimization in Mutidatabase Systems
Heterogeneities exist in a multidatabase environment For example a real world entity may be di erently represented in relations of di erent databases In particular keys of these relations may be incompatible In this paper we develop an entity join operator named EJ operator which can be used to join two relations on their compatible incompatible keys By this join if an enti ty is represented in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2017
ISSN: 2150-8097
DOI: 10.14778/3137628.3137656